package com.kehao.newcoder;

public class NC65Solution {
    public int Fibonacci(int n) {
        if(n==1||n==2) return 1;
        int n1 =1,n2 =1;
        for (int i = 0; i < n - 2; i++) {
            int tmp = n1+n2;
            n1 = n2;
            n2 = tmp;
        }
        return n2;
    }
}
